KERALA UNIVERSITY Class 7 design and algorthims Question Paper 2019

Practice authentic previous year questions for better exam preparation.

Sample Questions

Given $f(n)=n!$. Find $\theta(g(n))$ and the valid range of $n$.
Solve the recurrence relation : $$ T(n)= \begin{cases}T(n / 2)+T(n / 2)+2 & n>2 \\ 1 & n=2\end{cases} $$
Differentiate conventional problem solving method with that of recursive approach.
How will you find the shortest paths between all pairs of nodes in a graph?
Write an algorithm to represent a graph using adjacency matrix. Find the space complexity.